Robot Motion Planning in Dynamic Environments with Moving Obstacles and Target
نویسندگان
چکیده
This paper presents a new sensor-based online method for generating collision-free near-optimal paths for mobile robots pursuing a moving target amidst dynamic and static obstacles. At each iteration, first the set of all collision-free directions are calculated using velocity vectors of the robot relative to each obstacle and target, forming the Directive Circle (DC), which is a novel concept. Then, a direction close to the shortest path to the target is selected from feasible directions in DC. The DC prevents the robot from being trapped in deadlocks or local minima. It is assumed that the target’s velocity is known, while the speeds of dynamic obstacles, as well as the locations of static obstacles, are to be calculated online. Extensive simulations and experimental results demonstrated the efficiency of the proposed method and its success in coping with complex environments and obstacles. Keywords—Dynamic Environment, Moving Target, Robot Motion Planning.
منابع مشابه
Fast and Bounded Probabilistic Collision Detection in Dynamic Environments for High-DOF Trajectory Planning
We present a novel approach to perform probabilistic collision detection between a high-DOF robot and high-DOF obstacles in dynamic, uncertain environments. In dynamic environments with a highDOF robot and moving obstacles, our approach efficiently computes accurate collision probability between the robot and obstacles with upper error bounds. Furthermore, we describe a prediction algorithm for...
متن کاملMicrosoft Word - CONTENTS-AUGUST07
This paper presents a new sensor-based online method for generating collision-free near-optimal paths for mobile robots pursuing a moving target amidst dynamic and static obstacles. At each iteration, first the set of all collision-free directions are calculated using velocity vectors of the robot relative to each obstacle and target, forming the Directive Circle (DC), which is a novel concept....
متن کاملPlanning Robot Motion in a 2-D Region with Unknown Obstacles
The purpose of this paper is to present several algorithms for planning the motion of a robot in a two-dimensional region having obstacles whose shapes and locations are unknown. The convergence and efficiency of the algorithms are discussed and upper bounds for the lengths of paths generated by the different algorithms are derived and compared.
متن کاملFormation Control and Path Planning of Two Robots for Tracking a Moving Target
This paper addresses the dynamic path planning for two mobile robots in unknownenvironment with obstacle avoidance and moving target tracking. These robots must form atriangle with moving target. The algorithm is composed of two parts. The first part of thealgorithm used for formation planning of the robots and a moving target. It generates thedesired position for the robots for the next step. ...
متن کاملOn-line Path Planning for Mobile Robots in Dynamic Environments
Motion planning of mobile robots is a complex problem. The complexity further increases when it comes to path planning in dynamic environments. This paper presents an algorithm for on-line path planning of mobile robots in unknown environments with moving obstacles. A mathematical model is established which considers all the current on-line information of robot as well as nearing obstacles. Par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012